Machine Learning Experiments for Textual Entailment
نویسندگان
چکیده
We present a system that uses machine learning algorithms to combine features that capture various shallow heuristics for the task of recognizing textual entailment. The features quantify several types of matches and mismatches between the test and hypothesis sentences. Matching features represent lexical matching (including synonyms and related words), part-ofspeech matching and matching of grammatical dependency relations. Mismatch features include negation and numeric mismatches.
منابع مشابه
Machine Learning with Semantic-Based Distances Between Sentences for Textual Entailment
This paper describes our experiments on Textual Entailment in the context of the Third Pascal Recognising Textual Entailment (RTE-3) Evaluation Challenge. Our system uses a Machine Learning approach with Support Vector Machines and AdaBoost to deal with the RTE challenge. We perform a lexical, syntactic, and semantic analysis of the entailment pairs . From this information we compute a set of s...
متن کاملRecognizing Textual Entailment Using a Machine Learning Approach
We present our experiments on Recognizing Textual Entailment based on modeling the entailment relation as a classification problem. As features used to classify the entailment pairs we use a symmetric similarity measure and a non-symmetric similarity measure. Our system achieved an accuracy of 66% on the RTE-3 development dataset (with 10-fold cross validation) and accuracy of 63% on the RTE-3 ...
متن کاملA machine learning approach to textual entailment recognition
Designing models for learning textual entailment recognizers from annotated examples is not an easy task, as it requires modeling the semantic relations and interactions involved between two pairs of text fragments. In this paper, we approach the problem by first introducing the class of pair feature spaces, which allow supervised machine learning algorithms to derive first-order rewrite rules ...
متن کاملTALP at TAC 2008: A Semantic Approach to Recognizing Textual Entailment
This paper describes our experiments on Textual Entailment in the context of the Fourth Recognising Textual Entailment (RTE-4) Evaluation Challenge at TAC 2008 contest. Our system uses a Machine Learning approach with AdaBoost to deal with the RTE challenge. We perform a lexical, syntactic, and semantic analysis of the entailment pairs. From this information we compute a set of semantic-based d...
متن کاملEncoding Tree Pair-Based Graphs in Learning Algorithms: The Textual Entailment Recognition Case
In this paper, we provide a statistical machine learning representation of textual entailment via syntactic graphs constituted by tree pairs. We show that the natural way of representing the syntactic relations between text and hypothesis consists in the huge feature space of all possible syntactic tree fragment pairs, which can only be managed using kernel methods. Experiments with Support Vec...
متن کامل